Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
نویسندگان
چکیده
This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessment of GI. We provide a motivation for using the Rademacher complexity and give an example showing how this complexity measure can be used in practice.
منابع مشابه
Universal Grammar and Chaos/Complexity Theory: Where Do They Meet And Where Do They Cross?
Abstract The present study begins by sketching "Chaos/Complexity Theory" (C/CT) and its applica-tion to the nature of language and language acquisition. Then, the theory of "Universal Grammar" (UG) is explicated with an eye to C/CT. Firstly, it is revealed that CCT may or may not be allied with a theory of language acquisition that takes UG as the initial state of language acquisition for ...
متن کاملSparse Data and the Effect of Overfitting Avoidance in Decision Tree Induction
the training data itself to tell us whether it is sparse enough to make unpruned trees preferable. As argued at length in Schaaer, 1992b], training data cannot tell us what bias is appropriate to use in interpreting it. In particular, the sparsity of data depends on the complexity of the true relationship underlying data generation; and it is not data but domain knowledge that can tell us how c...
متن کاملیک مدل بیزی برای استخراج باناظر گرامر زبان طبیعی
In this paper, we show that the problem of grammar induction could be modeled as a combination of several model selection problems. We use the infinite generalization of a Bayesian model of cognition to solve each model selection problem in our grammar induction model. This Bayesian model is capable of solving model selection problems, consistent with human cognition. We also show that using th...
متن کاملRademacher Complexity
Rademacher complexity is a measure of the richness of a class of real-valued functions. In this sense, it is similar to the VC dimension. In fact, we will establish a uniform deviation bound in terms of Rademacher complexity, and then use this result to prove the VC inequality. Unlike VC dimension, however, Rademacher complexity is not restricted to binary functions, and will also prove useful ...
متن کاملThe Natural Rights of Children
What does libertarian theory, Murray Rothbard’s theory in particular, tell us about the rights of children? The two foundational principles of Rothbardian libertarianism are the sanctity of private property and the rule of non-aggression. Persons, including children, are “self-owners”. Yet children, at a young age, are not yet capable of functioning fully as “self-owners.” They must be cared fo...
متن کامل